Evolving network with different edges

Estimation of Network Reliability for a Fully Connected Network with Unreliable Nodes and Unreliable Edges using Neuro Optimization

In this paper it is tried to estimate the reliability of a fully connected network of some unreliable nodes and unreliable connections (edges) between them. The proliferation of electronic messaging has been witnessed during the last few years. The acute problem of node failure and connection failure is frequently encountered in communication through various types of networks. We know that a ne...

An evolving network model with community structure

Many social and biological networks consist of communities—groups of nodes within which connections are dense, but between which connections are sparser. Recently, there has been considerable interest in designing algorithms for detecting community structures in real-world complex networks. In this paper, we propose an evolving network model which exhibits community structure. The network model...

An evolving network model with modular growth

In this paper, we propose an evolving network model growing fast in units of module, based on the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected nodes, and the nodes between the modules are linked by preferential attachment on degree of nodes. We study the modularity measure of the proposed model, which ...

Complete Finite Automata Network Graphs with Minimal Number of Edges

Collaborative Filtering using Electrical Resistance Network Models with Negative Edges

In a recommender system where users rate items we predict the rating of items users have not rated. We define a rating graph containing users and items as vertices and ratings as weighted edges. We extend the work of [1] that uses the resistance distance on the bipartite rating graph incorporating negative edge weights into the calculation of the resistance distance. This algorithm is then comp...